Pattern-Matching with Bounded Gaps in Genomic Sequences
نویسندگان
چکیده
Recently, some pattern matching algorithms allowing gaps were introduced in Crochemore et. al. [1], where upper-bounded, strict-bounded and unbounded gaps were considered. In this paper we further extend these restrictions on the gaps to permit lower-bounded and (lower-upper)-bounded gaps that we simply refer to as (α, β)-bounded gaps. We give formal definitions for these problems as well as their respective algorithmic solutions.
منابع مشابه
A Simple Algorithm Implementation for Pattern-Matching with Bounded Gaps in Genomic and Proteomic Sequences, on the Grid EGEE Platform, using an Intuitive User Interface
In the last decade an unprecedented development in bioinformatics has been observed. An extremely high number of organisms have been sequenced and included in genomic databases. The huge amount of data produced needs to be stored and processed for further analysis. Scientists, have researched algorithms for finding complicated patterns in DNA sequences, but there is a need for computational pow...
متن کاملOn Tuning the (\delta, \alpha)-Sequential-Sampling Algorithm for \delta-Approximate Matching with Alpha-Bounded Gaps in Musical Sequences
We present a very efficient variant of the (δ, α)SEQUENTIAL-SAMPLING algorithm, recently introduced by the authors, for the δ-approximate string matching problem with α-bounded gaps, which often arises in many questions on musical information retrieval and musical analysis. Though it retains the same worst-case O(mn)-time and O(mα)-space complexity of its progenitor to compute the number of dis...
متن کاملSolving the (\delta, \alpha)-Approximate Matching Problem Under Transposition Invariance in Musical Sequences
The δ-approximate matching problem arises in many questions concerning musical information retrieval and musical analysis. In the case in which gaps are not allowed between consecutive pitches of the melody, transposition invariance is automatically taken care of, provided that the musical melodies are encoded using the pitch interval encoding. However, in the case in which nonnull gaps are all...
متن کاملNew Efficient Bit-Parallel Algorithms for the δ-Matching Problem with α-Bounded Gaps in Musical Sequences
We present new efficient variants of the (δ, α)-Sequential-Sampling algorithm, recently introduced by the authors, for the δ-approximate string matching problem with α-bounded gaps. These algorithms, which have practical applications in music information retrieval and analysis, make use of the well-known technique of bit-parallelism. An extensive comparison with the most efficient algorithms pr...
متن کاملByte-Aligned Pattern Matching in Encoded Genomic Sequences
In this article, we propose a novel pattern matching algorithm, called BAPM, that performs searching in the encoded genomic sequences. The algorithm works at the level of single bytes and it achieves sublinear performance on average. The preprocessing phase of the algorithm is linear with respect to the size of the searched pattern m. A simple O(m)-space data structure is used to store all fact...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Revista Colombiana de Computación
دوره 10 شماره
صفحات -
تاریخ انتشار 2009